Quantum lower bounds for the set equality problems
نویسنده
چکیده
The set equality problem is to decide whether two sets A and B are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set equality problem. It was an open problem to find any w(1) query lower bound when sets A and B are given by quantum oracles with functions a and b. We will prove Ω( n 1/3 log1/3 n ) lower bound for the set equality problem when the set of the preimages are very small for every element in A and B.
منابع مشابه
Quantum lower bounds of set equality problems
The set equality problem is to decide whether two sets given by functions a and b such that A = {a(1), a(2), ..., a(n)} and B = {b(1), b(2), ..., b(n)} are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set equality problem. This motivates to find a polynomial quantum lower bound for th...
متن کاملImproved Quantum Communication Complexity Bounds for Disjointness and Equality
We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n + 1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O( √ n·clog∗ n)-qubit bounded-error proto...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملQuantum Algorithms and Lower Bounds for Independent Set and Subgraph Isomorphism Problem
The study of the quantum query complexity for some graph problems is an interesting area in quantum computing. Only for a few graph problems there are quantum algorithms and lower bounds known. We present some new quantum query and quantum time algorithms and quantum query complexity bounds for the maximal and maximum independent set problem and the graph and subgraph isomorphism problem.
متن کامل